On Improving Conformant Planners by Analyzing Domain-Structures

نویسندگان

  • Hoang-Khoi Nguyen
  • Dang-Vien Tran
  • Tran Cao Son
  • Enrico Pontelli
چکیده

The paper introduces a novel technique for improving the performance and scalability of best-first progression-based conformant planners. The technique is inspired by different wellknown techniques from classical planning, such as landmark and stratification. Its most salient feature is that it is relatively cheap to implement yet quite effective when applicable. The effectiveness of the proposed technique is demonstrated by the development of new conformant planners by integrating the technique in various state-of-the-art conformant planners and an extensive experimental evaluation of the new planners using benchmarks collected from various sources. The result shows that the technique can be applied in several benchmarks and helps improve both performance and scalability of conformant planners.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conformant Planning for Domains with Constraints-A New Approach

The paper presents a pair of new conformant planners, CPA and CPA, based on recent developments in theory of action and change. As an input the planners take a domain description D in action language AL which allows state constraints (non-stratified axioms), together with a set of CNF formulae describing the initial state, and a set of literals representing the goal. We propose two approximatio...

متن کامل

Improvements to SAT-Based Conformant Planning

Planning as satisfiability is an efficient technique for classical planning. In previous work by the second author, this approach has been extended to conformant planning, that is, to planning domains having incomplete information about the initial state and/or the effects of actions. In this paper we present some domain independent optimizations to the basic procedure described in the previous...

متن کامل

Approximation of action theories and its application to conformant planning

This paper describes our methodology for building conformant planners, whichis based on recent advances in the theory of action and change and answer setprogramming. The development of a planner for a given dynamic domain starts withencoding the knowledge about fluents and actions of the domain as an action theoryD of some action language. Our choice in this paper is AL an actio...

متن کامل

A New Approach to Conformant Planning via Classical Planners

In this paper, we introduce a new approach to conformant planning via classical planners. We view a conformant planning problem as a set of classical planning problems, called sub-problems, and solve it using a generate-and-complete algorithm. Key to this algorithm is a procedure which takes a solution of a sub-problem and generates a solution for other sub-problems. We implement this algorithm...

متن کامل

A New Approach to Conformant Planning Using CNF*

In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-state. We define a transition function ΦCNF for computing the successor belief state resulting from the execution of an action in a belief state and prove that it is sound and complete with respect to the complete semantics defined...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011